On unitarizability and Arthur packets
نویسندگان
چکیده
In this paper we begin to explore the relation between question of unitarizability classical p-adic groups, and Arthur packets, starting from Tadi? (Mem Am Math Soc 2020, appear).
منابع مشابه
Notes on simultaneous unitarizability and n-noids
We give necessary and sufficient local conditions for the simultaneous unitarizability of a set of analytic matrix maps from an analytic 1-manifold into SLnC under conjugation by a single analytic matrix map. We apply this result to the monodromy arising from an integrable partial differential equation to construct a family of k-noids, genus-zero constant mean curvature surfaces with three or m...
متن کامل. R T ] 4 M ay 2 01 7 ARTHUR PACKETS AND ADAMS - BARBASCH - VOGAN PACKETS FOR p - ADIC GROUPS , 1 : BACKGROUND AND CONJECTURES
This paper begins the project of adapting the 1992 book by Adams, Barbasch and Vogan on the Langlands classification of admissible representations of real groups, to padic groups, continuing in the direction charted by Vogan in his 1993 paper on the Langlands correspondence. This paper presents three theorems in that direction. The first theorem shows how Lusztig’s work on perverse sheaves aris...
متن کاملAnd Arthur
Similarity is a focal idea in cognitive theory. It is used to help explain conceptual structure, transfer of learning, generalization, and other basic phenomena. Despite its importance no satisfactory process model for similarity has yet been proposed. Previous work has generally assumed that similarity requires a simple measurement of mental distance or a straightforward count of matching and ...
متن کاملOn Higher Arthur-Merlin Classes
We study higher Arthur-Merlin classes de ned via several natural probabilistic operators BP;R and co-R. We investigate the complexity classes they de ne, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bound...
متن کاملOn adaptive wavelet packets
An algorithm is presented for fast implementation of time-varying wavelet packets maintaining perfect reconstruction throughout transitions. It is based on filter banks known as the extended lapped transforms in an association following the paths of a binary-tree. Methods for pruning or expanding the branches of the tree are presented and a discussion on adaptation issues is carried. Recently, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Manuscripta Mathematica
سال: 2021
ISSN: ['0025-2611', '1432-1785']
DOI: https://doi.org/10.1007/s00229-021-01330-6